TSTP Solution File: SET609^3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET609^3 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:07:33 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 30
% Syntax : Number of formulae : 100 ( 25 unt; 19 typ; 0 def)
% Number of atoms : 682 ( 129 equ; 0 cnn)
% Maximal formula atoms : 4 ( 8 avg)
% Number of connectives : 555 ( 95 ~; 93 |; 66 &; 294 @)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 105 ( 105 >; 0 *; 0 +; 0 <<)
% Number of symbols : 29 ( 26 usr; 9 con; 0-3 aty)
% Number of variables : 72 ( 55 ^ 9 !; 6 ?; 72 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > ( $i > $o ) > $o ).
thf(func_def_2,type,
is_a: $i > ( $i > $o ) > $o ).
thf(func_def_3,type,
emptyset: $i > $o ).
thf(func_def_4,type,
unord_pair: $i > $i > $i > $o ).
thf(func_def_5,type,
singleton: $i > $i > $o ).
thf(func_def_6,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
complement: ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
disjoint: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_12,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_13,type,
meets: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_14,type,
misses: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_15,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_29,type,
sK0: $i > $o ).
thf(func_def_30,type,
sK1: $i > $o ).
thf(func_def_31,type,
sK2: $i > $o ).
thf(func_def_33,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f169,plain,
$false,
inference(avatar_sat_refutation,[],[f141,f155,f156,f158,f161,f165,f168]) ).
thf(f168,plain,
( ~ spl3_1
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f167]) ).
thf(f167,plain,
( $false
| ~ spl3_1
| ~ spl3_6 ),
inference(trivial_inequality_removal,[],[f166]) ).
thf(f166,plain,
( ( $false = $true )
| ~ spl3_1
| ~ spl3_6 ),
inference(backward_demodulation,[],[f126,f153]) ).
thf(f153,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f151]) ).
thf(f151,plain,
( spl3_6
<=> ( $false
= ( sK0 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
thf(f126,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f124]) ).
thf(f124,plain,
( spl3_1
<=> ( $true
= ( sK0 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f165,plain,
( ~ spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f164]) ).
thf(f164,plain,
( $false
| ~ spl3_3
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f163]) ).
thf(f163,plain,
( ( $false = $true )
| ~ spl3_3
| ~ spl3_4 ),
inference(backward_demodulation,[],[f145,f135]) ).
thf(f135,plain,
( ( ( sK1 @ sK5 )
= $false )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f133]) ).
thf(f133,plain,
( spl3_3
<=> ( ( sK1 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f145,plain,
( ( ( sK1 @ sK5 )
= $true )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f143]) ).
thf(f143,plain,
( spl3_4
<=> ( ( sK1 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f161,plain,
( ~ spl3_2
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f160]) ).
thf(f160,plain,
( $false
| ~ spl3_2
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f159]) ).
thf(f159,plain,
( ( $false = $true )
| ~ spl3_2
| ~ spl3_5 ),
inference(forward_demodulation,[],[f130,f149]) ).
thf(f149,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f147]) ).
thf(f147,plain,
( spl3_5
<=> ( $false
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
thf(f130,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f128]) ).
thf(f128,plain,
( spl3_2
<=> ( $true
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f158,plain,
spl3_1,
inference(avatar_split_clause,[],[f122,f124]) ).
thf(f122,plain,
( $true
= ( sK0 @ sK5 ) ),
inference(duplicate_literal_removal,[],[f120]) ).
thf(f120,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f119]) ).
thf(f119,plain,
( ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f107]) ).
thf(f107,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f88]) ).
thf(f88,plain,
( ( $true
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f87]) ).
thf(f87,plain,
( ( $true
= ( ~ ( sK1 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f67]) ).
thf(f67,plain,
( ( $true
= ( ( ~ ( sK1 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
| ( $true
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f66,plain,
( ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
!= ( ( ~ ( sK1 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(beta_eta_normalization,[],[f65]) ).
thf(f65,plain,
( ( ^ [Y0: $i] :
( ( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
| ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) )
@ sK5 )
!= ( ^ [Y0: $i] :
( ~ ( ~ ( sK2 @ Y0 )
& ( sK1 @ Y0 ) )
& ( sK0 @ Y0 ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f64]) ).
thf(f64,plain,
( ( ^ [Y0: $i] :
( ( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
| ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) ) ) )
!= ( ^ [Y0: $i] :
( ~ ( ~ ( sK2 @ Y0 )
& ( sK1 @ Y0 ) )
& ( sK0 @ Y0 ) ) ) ),
inference(beta_eta_normalization,[],[f63]) ).
thf(f63,plain,
( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK0
@ sK1 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK0
@ sK2 ) )
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK0
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK1
@ sK2 ) ) ),
inference(definition_unfolding,[],[f59,f50,f50,f54,f50,f53]) ).
thf(f53,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f38]) ).
thf(f38,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f37]) ).
thf(f37,plain,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,axiom,
( intersection
= ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X0 @ X3 )
& ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.5tFKUBUDRm/Vampire---4.8_23070',intersection) ).
thf(f54,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f36,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f35]) ).
thf(f35,plain,
( union
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
( union
= ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X2 @ X3 )
| ( X0 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.5tFKUBUDRm/Vampire---4.8_23070',union) ).
thf(f50,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f34]) ).
thf(f34,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f33]) ).
thf(f33,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
& ~ ( X1 @ X2 ) ) )
= setminus ),
inference(rectify,[],[f9]) ).
thf(f9,axiom,
( ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X0 @ X3 )
& ~ ( X2 @ X3 ) ) )
= setminus ),
file('/export/starexec/sandbox2/tmp/tmp.5tFKUBUDRm/Vampire---4.8_23070',setminus) ).
thf(f59,plain,
( ( setminus @ sK0 @ ( setminus @ sK1 @ sK2 ) )
!= ( union @ ( setminus @ sK0 @ sK1 ) @ ( intersection @ sK0 @ sK2 ) ) ),
inference(cnf_transformation,[],[f46]) ).
thf(f46,plain,
( ( setminus @ sK0 @ ( setminus @ sK1 @ sK2 ) )
!= ( union @ ( setminus @ sK0 @ sK1 ) @ ( intersection @ sK0 @ sK2 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f44,f45]) ).
thf(f45,plain,
( ? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( union @ ( setminus @ X0 @ X1 ) @ ( intersection @ X0 @ X2 ) )
!= ( setminus @ X0 @ ( setminus @ X1 @ X2 ) ) )
=> ( ( setminus @ sK0 @ ( setminus @ sK1 @ sK2 ) )
!= ( union @ ( setminus @ sK0 @ sK1 ) @ ( intersection @ sK0 @ sK2 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f44,plain,
? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( union @ ( setminus @ X0 @ X1 ) @ ( intersection @ X0 @ X2 ) )
!= ( setminus @ X0 @ ( setminus @ X1 @ X2 ) ) ),
inference(ennf_transformation,[],[f43]) ).
thf(f43,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( union @ ( setminus @ X0 @ X1 ) @ ( intersection @ X0 @ X2 ) )
= ( setminus @ X0 @ ( setminus @ X1 @ X2 ) ) ),
inference(rectify,[],[f16]) ).
thf(f16,negated_conjecture,
~ ! [X0: $i > $o,X2: $i > $o,X4: $i > $o] :
( ( setminus @ X0 @ ( setminus @ X2 @ X4 ) )
= ( union @ ( setminus @ X0 @ X2 ) @ ( intersection @ X0 @ X4 ) ) ),
inference(negated_conjecture,[],[f15]) ).
thf(f15,conjecture,
! [X0: $i > $o,X2: $i > $o,X4: $i > $o] :
( ( setminus @ X0 @ ( setminus @ X2 @ X4 ) )
= ( union @ ( setminus @ X0 @ X2 ) @ ( intersection @ X0 @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.5tFKUBUDRm/Vampire---4.8_23070',thm) ).
thf(f156,plain,
( spl3_6
| spl3_4 ),
inference(avatar_split_clause,[],[f79,f143,f151]) ).
thf(f79,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f76]) ).
thf(f76,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $true )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f75]) ).
thf(f75,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f74]) ).
thf(f74,plain,
( ( $false
= ( ~ ( sK1 @ sK5 ) ) )
| ( ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f73]) ).
thf(f73,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ~ ( sK1 @ sK5 ) ) )
| ( ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f72]) ).
thf(f72,plain,
( ( $false
= ( ~ ( sK1 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
= $true ) ),
inference(not_proxy_clausification,[],[f71]) ).
thf(f71,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) ) )
| ( $false
= ( ~ ( sK1 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f69]) ).
thf(f69,plain,
( ( $false
= ( ( ~ ( sK1 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f68]) ).
thf(f68,plain,
( ( $false
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) )
| ( $false
= ( ( ~ ( sK1 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f155,plain,
( spl3_5
| spl3_6 ),
inference(avatar_split_clause,[],[f86,f151,f147]) ).
thf(f86,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f85]) ).
thf(f85,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f84]) ).
thf(f84,plain,
( ( ( ~ ( sK2 @ sK5 ) )
= $true )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f82]) ).
thf(f82,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f81]) ).
thf(f81,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) ) ) ),
inference(duplicate_literal_removal,[],[f80]) ).
thf(f80,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f70]) ).
thf(f70,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $false
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f69]) ).
thf(f141,plain,
( spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f99,f133,f128]) ).
thf(f99,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f98]) ).
thf(f98,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f97]) ).
thf(f97,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( $true
= ( sK2 @ sK5 ) )
| ( ( ~ ( sK2 @ sK5 ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f96]) ).
thf(f96,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( ( ~ ( sK2 @ sK5 ) )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f95]) ).
thf(f95,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $false
= ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(not_proxy_clausification,[],[f94]) ).
thf(f94,plain,
( ( $true
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) ) )
| ( ( sK1 @ sK5 )
= $false )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f92]) ).
thf(f92,plain,
( ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $false )
| ( $true
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f90]) ).
thf(f90,plain,
( ( $true
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(not_proxy_clausification,[],[f89]) ).
thf(f89,plain,
( ( $true
= ( ~ ( sK1 @ sK5 ) ) )
| ( $true
= ( ~ ( ~ ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SET609^3 : TPTP v8.1.2. Released v3.6.0.
% 0.07/0.16 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.38 % Computer : n027.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8042.1875MB
% 0.14/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Fri May 3 16:51:08 EDT 2024
% 0.14/0.38 % CPUTime :
% 0.14/0.38 This is a TH0_THM_EQU_NAR problem
% 0.14/0.38 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.5tFKUBUDRm/Vampire---4.8_23070
% 0.14/0.40 % (23182)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.14/0.40 % (23181)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.14/0.40 % (23185)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.14/0.40 % (23184)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.14/0.40 % (23187)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.14/0.40 % (23183)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.14/0.40 % (23186)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.14/0.40 % (23184)Instruction limit reached!
% 0.14/0.40 % (23184)------------------------------
% 0.14/0.40 % (23184)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (23184)Termination reason: Unknown
% 0.14/0.40 % (23184)Termination phase: shuffling
% 0.14/0.40
% 0.14/0.40 % (23184)Memory used [KB]: 1023
% 0.14/0.40 % (23184)Time elapsed: 0.002 s
% 0.14/0.40 % (23184)Instructions burned: 2 (million)
% 0.14/0.40 % (23184)------------------------------
% 0.14/0.40 % (23184)------------------------------
% 0.14/0.40 % (23181)Instruction limit reached!
% 0.14/0.40 % (23181)------------------------------
% 0.14/0.40 % (23181)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (23181)Termination reason: Unknown
% 0.14/0.40 % (23181)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (23181)Memory used [KB]: 5500
% 0.14/0.40 % (23181)Time elapsed: 0.003 s
% 0.14/0.40 % (23181)Instructions burned: 4 (million)
% 0.14/0.40 % (23181)------------------------------
% 0.14/0.40 % (23181)------------------------------
% 0.14/0.40 % (23183)Instruction limit reached!
% 0.14/0.40 % (23183)------------------------------
% 0.14/0.40 % (23183)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (23183)Termination reason: Unknown
% 0.14/0.40 % (23183)Termination phase: Property scanning
% 0.14/0.40
% 0.14/0.40 % (23183)Memory used [KB]: 1023
% 0.14/0.40 % (23183)Time elapsed: 0.003 s
% 0.14/0.40 % (23183)Instructions burned: 3 (million)
% 0.14/0.40 % (23183)------------------------------
% 0.14/0.40 % (23183)------------------------------
% 0.14/0.40 % (23187)Instruction limit reached!
% 0.14/0.40 % (23187)------------------------------
% 0.14/0.40 % (23187)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (23187)Termination reason: Unknown
% 0.14/0.40 % (23187)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (23187)Memory used [KB]: 5500
% 0.14/0.40 % (23187)Time elapsed: 0.003 s
% 0.14/0.40 % (23187)Instructions burned: 4 (million)
% 0.14/0.40 % (23187)------------------------------
% 0.14/0.40 % (23187)------------------------------
% 0.14/0.40 % (23182)First to succeed.
% 0.14/0.40 % (23180)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.14/0.40 % (23185)Also succeeded, but the first one will report.
% 0.14/0.40 % (23186)Also succeeded, but the first one will report.
% 0.14/0.40 % (23182)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for Vampire---4
% 0.14/0.40 % SZS output start Proof for Vampire---4
% See solution above
% 0.14/0.40 % (23182)------------------------------
% 0.14/0.40 % (23182)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (23182)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (23182)Memory used [KB]: 5500
% 0.14/0.40 % (23182)Time elapsed: 0.007 s
% 0.14/0.40 % (23182)Instructions burned: 6 (million)
% 0.14/0.40 % (23182)------------------------------
% 0.14/0.40 % (23182)------------------------------
% 0.14/0.40 % (23179)Success in time 0.017 s
% 0.14/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------